Analysis of Iteration Control for Turbo Decoders in Turbo Synchronization Applications

نویسندگان

  • Timo Lehnigk-Emden
  • Uwe Wasenmüller
  • Christina Gimmler
  • Norbert Wehn
چکیده

Wireless data transmission results in frequency and phase offsets of the signal in the receiver. In addition, the received symbols are corrupted by noise. Therefore, synchronization and channel coding are vital parts of each receiver in digital communication systems. By combining the phase and frequency synchronization with an advanced iterative channel decoder (inner loop) e.g. turbo codes in an iterative way (outer loop), the communications performance can be further increased. This principle is referred to as turbo synchronization. The energy consumption and the peak throughput of the system depend on the number of iterations for both loops. An advanced iteration control can decrease the mean number of needed iterations by detecting correctly decoded blocks. This leads to a dramatic energy saving or to an increase of throughput. In this paper we present a new stopping criterion for decodable blocks for turbo decoding in interrelation with turbo synchronization. Furthermore the implementation complexity of the turbo decoder is shown on a Xilinx FPGA.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High Speed Low Power Adaptive Viterbi Decoder Architecture for Underwater Acoustic Communication with Turbo Codes

Underwater acoustic communication module based on Orthogonal Frequency Division Multiplexing (OFDM) uses rate 1⁄2 convolutional encoders and Turbo decoders for error control coding. Turbo decoders are designed with two Viterbi decoders that operate in sequence to improve Log Likelihood Ratio (LLR). The computation complexity of Viterbi decoders limits their use for high speed decoding as the de...

متن کامل

Stopping Rules for Turbo Decoders

Decoders for turbo codes are iterative in nature, i.e., they have to perform a certain number of iterations before reaching a satisfactory degree of confidence regarding a frame to be decoded. Until now standard turbo decoders have used a fixed number of iterations. In this article, we propose some simple “stopping rules” that can be used to reduce the average number of iterations. This techniq...

متن کامل

VLSI-implementation issues of turbo trellis-coded modulation

Turbo Trellis-Coded Modulation (TTCM) is a very promising approach for future communication systems. It combines the advantages of channel coding with multilevel signals and the powerful Turbo-Codes concept. In this paper we consider VLSI implementation aspects of TTCM. We show that techniques, known from binary Turbo-Decoders, can be applied to TTCM to reduce the implementation complexity sign...

متن کامل

Iterative multi-user turbo-code receiver for DS-CDMA

The topic of interference cancellation in a coded Code Division Multiple Access (CDMA) system has been the focus of much recent research. Earlier works have studied methods for jointly decoding all the users resulting in most having an exponential complexity for the corresponding receiver. In this report, a number of di erent iterative decoding methods are proposed for the multi-user interferen...

متن کامل

Parallel VLSI architecture for MAP turbo decoder

Turbo codes achieve performance near the Shannon limit. Standard sequential VLSI implementation of turbo decoding requires many iterations and incurs a long latency, which cannot be tolerated in some applications. A novel parallel VLSI architecture for turbo decoding is described, comprising multiple SISO elements, operating jointly on one turbo coded block, and a new parallel interleaver. Late...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009